Partitioning planar graphs: a fast combinatorial approach for max-cut
نویسندگان
چکیده
منابع مشابه
A Simple MAX-CUT Algorithm for Planar Graphs
The max-cut problem asks for partitioning the nodes V of a graph G = (V,E) into two sets (one of which might be empty), such that the sum of weights of edges joining nodes in different partitions is maximum. Whereas for general instances the max-cut problem is NPhard, it is polynomially solvable for certain classes of graphs. For planar graphs, there exist several polynomial-time methods determ...
متن کاملCut, Glue, & Cut: A Fast, Approximate Solver for Multicut Partitioning
Recently, unsupervised image segmentation has become increasingly popular. Starting from a superpixel segmentation, an edge-weighted region adjacency graph is constructed. Amongst all segmentations of the graph, the one which best conforms to the given image evidence, as measured by the sum of cut edge weights, is chosen. Since this problem is NP-hard, we propose a new approximate solver based ...
متن کاملA Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
We propose a fixed-parameter tractable algorithm for the Max-Cut problem on embedded 1-planar graphs parametrized by the crossing number k of the given embedding. A graph is called 1-planar if it can be drawn in the plane with at most one crossing per edge. Our algorithm recursively reduces a 1-planar graph to at most 3 planar graphs, using edge removal and node contraction. The Max-Cut problem...
متن کاملMax-cut in circulant graphs
Poljak, S. and D. Turzik, Max-cut in circulant graphs, Discrete Mathematics 108 (1992) 379-392. We study the max-cut problem in circulant graphs C,,,, where C,,, is a graph whose edge set consists of a cycle of length n and all the vertex pairs of distance r on the cycle. An efficient solution of the problem is obtained so that we show that there is always a maximum cut of a particular shape, c...
متن کاملFast Distributed Approximation for Max-Cut
Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their neighbors according to the underlying graph, known as the LOCAL or CONGEST models. We amend this by obtaining almost optimal algorithms for Max-Cut on a wide class o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2010
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-010-9335-5